Real Time Asymptotic Packing

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Real time asymptotic packing

A random greedy algorithm, somewhat modified, is analyzed by using a real time context and showing that the variables remain close to the solution of a natural differential equation. Given a (k + 1)-uniform simple hypergraph on N vertices, regular of degree D, the algorithm gives a packing of disjoint hyperedges containing all but O(ND−1/k lnD) of the vertices. Let H = (V, E) be a (k+ 1)-unifor...

متن کامل

Real Time Asymptotic

1 Abstract A random greedy algorithm, somewhat modiied, is analyzed by using a real time context and showing that the variables remain close to the solution of a natural diierential equation. Given a (k + 1)-uniform simple hypergraph on N vertices, regular of degree D, the algorithm gives a packing of disjoint hyperedges containing all but O(ND ?1=k ln c D) of the vertices. Let H = (V; E) be a ...

متن کامل

Frame packing in real-time communication

A common computational model in distributed embedded systems is that the nodes exchange signals via a network. Most often a signal represents the state of some physical device and has a signal size ranging from a single bit up to a few bytes. Furthermore, each signal typically has a deadline requirement. The communication networks used are often based on a broadcast bus where fixed or variable ...

متن کامل

Frame Packing in Real - Time Communication - Technical report

A common computational model in distributed embedded systems is that the nodes exchange signals via a network. Most often a signal represents the state of some physical device and has a signal size ranging from a single bit up to a few bytes. Furthermore, each signal typically has a deadline requirement. The communication networks used are often based on a broadcast bus where fixed or variable ...

متن کامل

Partitioning bin-packing algorithms for distributed real-time systems

Embedded real-time systems must satisfy not only logical functional requirements but also para-functional properties such as timeliness, Quality of Service (QoS) and reliability. We have developed a model-based tool called Time Weaver which enables the modeling of functional and para-functional behaviors of real-time systems. It also performs automated schedulability analysis, and generates glu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 1996

ISSN: 1077-8926

DOI: 10.37236/1334